A weighted graph zeta function involved in the Szegedy walk
نویسندگان
چکیده
We define a new weighted zeta function for finite graph and obtain its determinant expression. This result gives the characteristic polynomial of transition matrix Szegedy walk on graph.
منابع مشابه
Quaternionic quantum walks of Szegedy type and zeta functions of graphs
We define a quaternionic extension of the Szegedy walk on a graph and study its right spectral properties. The condition for the transition matrix of the quaternionic Szegedy walk on a graph to be quaternionic unitary is given. In order to derive the spectral mapping theorem for the quaternionic Szegedy walk, we derive a quaternionic extension of the determinant expression of the second weighte...
متن کاملWeighted Zeta Functions of Graph Coverings
We present a decomposition formula for the weighted zeta function of an irregular covering of a graph by its weighted L-functions. Moreover, we give a factorization of the weighted zeta function of an (irregular or regular) covering of a graph by equivalence classes of prime, reduced cycles of the base graph. As an application, we discuss the structure of balanced coverings of signed graphs.
متن کاملRemarks on the Zeta Function of a Graph
We make two observations about the zeta function of a graph. First we show how Bass’s proof of Ihara’s formula fits into the framework of torsion of complexes. Second, we show how in the special case of those graphs that are quotients of the Bruhat-Tits tree for SL(2, K) for a local nonarchimedean field K, the zeta function has a natural expression in terms of the L-functions of Coexter systems.
متن کاملProperties Determined by the Ihara Zeta Function of a Graph
In this paper, we show how to determine several properties of a finite graph G from its Ihara zeta function ZG(u). If G is connected and has minimal degree at least 2, we show how to calculate the number of vertices of G. To do so we use a result of Bass, and in the case that G is nonbipartite, we give an elementary proof of Bass’ result. We further show how to determine whether G is regular, a...
متن کاملGraph zeta function and loopy belief propagation
This paper discusses a link between the loopy belief propagation (LBP) algorithm and the Graph zeta function. The LBP algorithm is a nonlinear iteration to approximate the marginal or posterior probabilities required for various statistical inference, using the graph structure to define the joint probability. The theoretical properties of the LBP algorithm are not easy to analyze because of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information & Computation
سال: 2022
ISSN: ['1533-7146']
DOI: https://doi.org/10.26421/qic22.1-2-3